Universal Forms: The Four-Square Theorem and its Generalizations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heights and quadratic forms: Cassels’ theorem and its generalizations

In this survey paper, we discuss the classical Cassels’ theorem on existence of small-height zeros of quadratic forms over Q and its many extensions, to different fields and rings, as well as to more general situations, such as existence of totally isotropic small-height subspaces. We also discuss related recent results on effective structural theorems for quadratic spaces, as well as Cassels’-...

متن کامل

Quarternions and the Four Square Theorem

The Four Square Theorem was proved by Lagrange in 1770: every positive integer is the sum of at most four squares of positive integers, i.e. n = A2 + B2 + C2 + D2, A, B, C, D ∈ Z An interesting proof is presented here based on Hurwitz integers, a subset of quarternions which act like integers in four dimensions and have the prime divisor property. It is analogous to Fermat’s Two Square Theorem,...

متن کامل

The Glivenko Cantelli Theorem and its Generalizations

In this note we will study upper bounds of random variables of the type sup A∈A |ν n (A) − ν(A)| , where A is a class of sets that needs to fulll certain assumptions. These bounds are important tools in the analysis of learning processes and probabilistic theories of pattern recognition. The presentation given here is based on [DGL96].

متن کامل

Eneström-Kakeya Theorem and Some of Its Generalizations

The study of the zeros of polynomials has a very rich history. In addition to having numerous applications, this study has been the inspiration for much theoretical research (including being the initial motivation for modern algebra). The earliest contributors to this subject were Gauss and Cauchy. Algebraic and analytic methods for finding zeros of a polynomial, in general, can be quite compli...

متن کامل

Gleason’s Theorem on Self-Dual Codes and Its Generalizations

One of the most remarkable theorems in coding theory is Gleason’s 1970 theorem about the weight enumerators of self-dual codes. In the past 36 years there have been hundreds of papers written about generalizations and applications of this theorem to different types of codes, always on a case-by-case basis. In this talk I will state the theorem and then describe the far-reaching generalization t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Missouri Journal of Mathematical Sciences

سال: 2003

ISSN: 0899-6180

DOI: 10.35834/2003/1503153